/**
 * 输出从vi到vj的所有简单路径
 * 简单路径：没有环的路径
 */

#include"store_table.h"
int visited[MAX_VERTEX_NUM];
void print(int a[MAX_VERTEX_NUM]){};

void find(ALGraph*g,int u,int v,int path[],int d){
    int w;
    ArcNode *p;
    d++;//路径长度+1
    path[d]=u;
    visited[u]=1;
    if(u==v){
        print(path);
    }
    p=g->vertices->first_arc;
    while (p!=nullptr)
    {
        w=p->adjvex;
        if(visited[w]==0){
            find(g,w,v,path,d);
        }
        p=p->next_arc;
    }
    visited[u]=0;
    
    

}